Dispatching method and device for integrated transmission and distribution network

ABSTRACT

The present disclosure provides a dispatching method and a dispatching device for an integrated transmission and distribution network. The integrated transmission and distribution network includes a transmission network and at least one distribution network. The method includes: establishing a dispatch model of the integrated transmission and distribution network, in which dispatch model includes an objective function and constraints, the objective function is a minimizing function of a total generation cost of the transmission network and the at least one distribution network under the constraints; solving the dispatch model to obtain dynamic dispatch parameters for the integrated transmission and distribution network; and dispatching the integrated transmission and distribution network according to the dynamic dispatch parameters.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority to and benefits of Chinese Patent Application Serial No. 201710087438.1, filed with the State Intellectual Property Office of P. R. China on Feb. 17, 2017, the entire contents of which are incorporated herein by reference.

FIELD

The present disclosure relates to a field of power system operation and control technology, and more particularly to a dispatching method and a dispatching device for an integrated transmission and distribution network.

BACKGROUND

As large scale distributed renewable energy resources are integrated into distribution networks, payload of the distribution networks changes dramatically and has a strong unpredictability, and power between a transmission network and a distribution network changes rapidly. Traditional dynamic dispatch is conducted separately for the transmission network and the distribution network. However, it is easy to cause a power mismatch problem in boundary between the transmission network and the distribution network when the large scale distributed renewable energy resources are integrated. In addition, because the transmission network and the distribution network are operated by their own dispatch center respectively, operation information between them are private, global dispatch of integrated transmission and distribution networks can not be achieved, and a global optimal solution of integrated transmission and distribution networks can not be achieved by independent dispatch.

SUMMARY

Embodiments of the present disclosure provide a dispatching method for an integrated transmission and distribution network. The integrated transmission and distribution network includes a transmission network and at least one distribution network. The method includes: establishing a dispatch model of the integrated transmission and distribution network, in which the dispatch model includes an objective function and constraints, the objective function is a minimizing function of a total generation cost of the transmission network and the at least one distribution network under the constraints, solving the dispatch model to obtain dynamic dispatch parameters for the integrated transmission and distribution network; and dispatching the integrated transmission and distribution network according to the dynamic dispatch parameters.

Embodiments of the present disclosure provide a dispatching device for an integrated transmission and distribution network. The integrated transmission and distribution network includes a transmission network and at least one distribution network. The device includes a processor; and a memory for storing instructions executable by the processor, in which the processor is configured to perform the above dispatching method for an integrated transmission and distribution network.

Embodiments of the present disclosure provide a non-transitory computer-readable storage medium having stored therein instructions that, when executed by a processor of a computer, causes the computer to perform the above dispatching method for an integrated transmission and distribution network.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other aspects and advantages of embodiments of the present disclosure will become apparent and more readily appreciated from the following descriptions made with reference to the drawings, in which:

FIG. 1 is a flow chart of a dispatching method for an integrated transmission and distribution network according to an exemplary embodiment.

FIG. 2 is a flow chart of a method for solving a dispatch model according to another exemplary embodiment.

DETAILED DESCRIPTION

In order to make objectives, technical solutions and advantages of the present disclosure clearer, in the following the present disclosure will be described in detail with reference to drawings. Apparently, the described embodiments are only some embodiments of the present disclosure and do not represent all the embodiments. Based on the embodiment described herein, all the other embodiments obtained by those skilled in the art without creative labor belong to the protection scope of the present disclosure.

FIG. 1 is a flow chart of a dispatching method for an integrated transmission and distribution network according to an exemplary embodiment. The integrated transmission and distribution network includes a transmission network and at least one distribution network. As illustrated in FIG. 1, the method includes followings.

At block 10, a dispatch model of the integrated transmission and distribution network is established. The dispatch model includes an objective function and constraints. The objective function is a minimizing function of a total generation cost of the transmission network and the at least one distribution network under the constraints.

At block 20, the dispatch model is solved to obtain dynamic dispatch parameters for the integrated transmission and distribution network.

At block 30, the integrated transmission and distribution network is dispatched according to the dynamic dispatch parameters.

In the following, the method will be described in detail.

The method is a dynamic dispatching method based on multi-parametric programming. The multi-parametric programming relates to a mathematical optimization field, which can transform a quadratic programming problem with parameters into a piecewise quadratic function related to parameters.

(1) The dispatch model of the integrated transmission and distribution network is established

The dispatch model includes the objective function and the constraints. The objective function is a minimizing function of a total generation cost of the transmission network and the at least one distribution network under the constraints.

(1-1) The objective function of the dispatch model of the integrated transmission and distribution network

The objective function of the dispatch model of the integrated transmission and distribution network aims to minimize a total generation cost of the transmission network and the at least one distribution network. The total generation cost of the transmission network and the at least one distribution network is established by a formula of:

$\begin{matrix} {{\sum\limits_{t \in T}{\sum\limits_{i \in G^{trans}}{C_{i}^{trans}\left( {pg}_{i,t}^{trans} \right)}}} + {\sum\limits_{t \in T}{\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},\; k}}{C_{i}^{{dist},\; k}\left( {pg}_{i,\; t}^{{dist},\; k} \right)}}}}} & (1) \end{matrix}$

where, T is an index set of dispatching time horizon, G^(trans) is an index set of generator bus numbers in the transmission network, DIST is an index set of the at least one distribution network, G^(dist,k) is an index set of generator bus numbers in a distribution network k, C_(i) ^(trans)(pg_(i,t) ^(trans)) is a cost function of a generator at a bus i of the transmission network during a period t, pg_(i,t) ^(trans) is a real power output of the generator at the bus i of the transmission network during the period t, C_(i) ^(dist,k)(pg_(i,t) ^(dist,k)) is a cost function of a generator at a bus i of the distribution network k during the period t, pg_(i,t) ^(dist,k) is a real power output of the generator at the bus i of the distribution network k during the period t.

In some embodiments of the present disclosure, C_(i) ^(trans)(pg_(i,t) ^(trans)) is expressed as:

C _(trans)(pg _(i,t) ^(trans))=a _(0,t) ^(trans) +a _(1,t) ^(trans) pg _(i,t) ^(trans) +a _(2,t) ^(trans)(pg _(i,t) ^(trans))²  (2),

where, a_(0,t) ^(trans) is a constant coefficient of generation cost of the generator at the bus i of the transmission network, a_(1,t) ^(trans) is a linear coefficient of generation cost of the generator at the bus i of the transmission network, and a_(2,t) ^(trans) is a quadratic coefficient of generation cost of the generator at the bus i of the transmission network. a_(0,t) ^(trans), a_(1,t) ^(trans), and a_(2,t) ^(trans) are inherent parameters of the generator.

In some embodiments of the present disclosure, C_(i) ^(dist,k)(pg_(i,t) ^(dist,k)) is expressed as:

C _(i) ^(dist,k)(pg _(i,t) ^(dist,k))=a _(0,i) ^(dist,k) +a _(1,t) ^(dist,k) pg _(i,t) ^(dist,k) +a _(2,t) ^(dist,k)(pg _(i,t) ^(dist,k))²  (3)

where, a_(0,t) ^(dist,k) is a constant coefficient of generation cost of the generator at the bus i of the distribution network k, a_(1,t) ^(dist,k) is a linear coefficient of generation cost of the generator at the bus i of the distribution network k, and a₂ ^(dist,k) is a quadratic coefficient of generation cost of the generator at the bus i of the distribution network k. a_(0,t) ^(dist,k), a_(1,t) ^(dist,k), and a_(2,t) ^(dist,k) are inherent parameters of the generator.

(1-2) The constraints of the integrated transmission and distribution network

The constraints include constraints of the transmission network, constraints of the at least one distribution network, and boundary constraints.

(1-2-1) The constraints of the transmission network

The constraints of the transmission network include power balance constraints, constraints of line transmission capacity of the transmission network, spinning reserve constraints, ramping constraints, and active power constraints of generators in the transmission network.

The power balance constraints are denoted by a formula of:

$\begin{matrix} {{{\sum\limits_{i \in G^{trans}}{pg}_{i,\; t}^{trans}} = {{\sum\limits_{i \in B^{trans}}{pb}_{i,\; t}^{trans}} + {\sum\limits_{i \in D^{trans}}{PD}_{i,\; t}^{trans}}}},{\forall{t \in T}}} & (4) \end{matrix}$

where, B^(trans) is an index set of boundary bus numbers between the transmission network and the at least one distribution network, pb_(i,t) ^(trans) is a transferred real power at the bus i of the transmission network to the at least one distribution network during the period t, D^(trans) is an index set of load bus numbers of the transmission network, PD_(i,t) ^(trans) is a load predication value at the bus i during the period t.

The constraints of line transmission capacity of the transmission network are denoted by a formula of:

$\begin{matrix} {{{- {PL}_{n}^{trans}} \leq {{\sum\limits_{i \in G^{trans}}{{SF}_{n - i}^{trans}{pg}_{i,\; t}^{trans}}} - {\sum\limits_{i \in B^{trans}}{{SF}_{n - i}^{trans}{pb}_{i,\; t}^{trans}}} - {\sum\limits_{i \in D^{trans}}{{SF}_{n - i}^{trans}{PD}_{i,\; t}^{trans}}}} \leq {PL}_{n}^{trans}},{\forall{n \in L^{trans}}},{\forall{t \in T}}} & (5) \end{matrix}$

where, PL_(n) ^(trans) is an active power flow limit of a line n in the transmission network, SF_(n-i) ^(trans) is a shift distribution factor of the bus i on the line n, the shift distribution factor is a topological parameter of the integrated transmission and distribution network and can be directly obtained from a dispatching center of the integrated transmission and distribution network, L^(trans) is an index set of line numbers of the transmission network.

The spinning reserve constraints of the transmission network are denoted by a formula of:

$\begin{matrix} \begin{matrix} {{0 \leq {ru}_{i,\; t}^{trans} \leq {{RU}_{i}^{trans}\Delta \; t}},{{ru}_{i,\; t}^{trans} \leq {{\overset{\_}{PG}}_{i}^{trans} - {pg}_{i,\; t}^{trans}}},{\forall{i \in G^{trans}}},{\forall{t \in T}}} \\ {{0 \leq {r\; d_{i,\; t}^{trans}} \leq {{RD}_{i}^{trans}\Delta \; t}},{{r\; d_{i,\; t}^{trans}} \leq {{pg}_{i,t}^{trans} - {\underset{\_}{PG}}_{i}^{trans}}},{\forall{i \in G^{trans}}},{\forall{t \in T}}} \\ {{{\sum\limits_{i \in G^{trans}}{ru}_{i,\; t}^{trans}} \geq {SRU}_{t}^{trans}},{{\sum\limits_{i \in G^{trans}}{rd}_{i,\; t}^{trans}} \geq {SRD}_{t}^{trans}},{\forall{t \in T}}} \end{matrix} & (6) \end{matrix}$

where, ru_(i,t) ^(trans) is an upward spinning reserve contribution of the generator at the bus i of the transmission network during the period t, rd_(i,t) ^(trans) is a downward spinning reserve contribution of the generator at the bus i of the transmission network during the period t, RU_(i) ^(trans) is an upward ramp rate of the generator at the bus i of the transmission network during the period t, RD_(i) ^(trans) is a downward ramp rate of the generator at the bus i of the transmission network during the period t, Δt is a time interval for dispatching, a value of the time interval is determined according to a power dispatching demand. PG _(i) ^(trans), is a maximum real power output of the generator at the bus i of the transmission network. PG _(i) ^(trans) is a minimum real power output of the generator at the bus i of the transmission network, SRU_(i) ^(trans) is an upward spinning reserve capacity requirement of the transmission network during the period t, SRD_(i) ^(trans) is a downward spinning reserve capacity requirement of the transmission network during the period t.

The ramping constraints of the transmission network are denoted by a formula of:

−RD _(i) ^(trans) Δt≤pg _(i,t+1) ^(trans) −pg _(i,t) ^(trans) ≤RU _(i) ^(trans) Δt, ∀i∈G ^(trans) , ∀t∈T  (7).

The active power constraints of generators in the transmission network are denoted by a formula of:

PG _(i) ^(trans) ≤pg _(i,t) ^(trans) ≤PG _(i) ^(trans) , ∀i∈G ^(trans) , ∀t∈T  (8).

(1-2-2) The constraints of the at least one distribution network

The constraints of the at least one distribution network include power flow constraints, constraints of line transmission capacity of each distribution network, and active power constraints of generators in each distribution network.

The power flow constraints of the at least one distribution network are denoted by a formula of:

$\begin{matrix} {{{\sum\limits_{i:{i\rightarrow j}}\left( {p_{{i\rightarrow j},\; t}^{{dist},\; k} - l_{{i\rightarrow j},\; t}^{{dist},\; k}} \right)} + p_{j,\; t}^{{dist},\; k} - {\sum\limits_{m:{j\rightarrow m}}p_{{j\rightarrow m},\; t}^{{dist},\; k}}},{\forall{j \in N^{{dist},\; k}}},{\forall{t \in T}}} & (9) \end{matrix}$

where, p_(i→j,t) ^(dist,k) is a line flow from a bus i to a bus j in a distribution network k during a period t, l_(i→j,t) ^(dist,k) is a line loss from the bus i to the bus j in the distribution network k during the period t, p_(j,t) ^(dist,k) is an power injection at the bus j in the distribution network k during the period t, N^(dist,k) is an index set of bus numbers of the distribution network k.

In some embodiments of the present disclosure, p_(j,t) ^(dist,k) is obtained according to a formula of:

$p_{j,t}^{{dist},\; k} = \left\{ {\begin{matrix} \begin{matrix} {{{pg}_{j,\; t}^{{dist},\; k} - {PD}_{j,\; t}^{{dist},\; k} + {pb}_{t}^{{dist},\; k}},} \\ {j\mspace{14mu} {is}\mspace{14mu} {connected}\mspace{14mu} {to}\mspace{14mu} {the}\mspace{14mu} k^{th}\mspace{14mu} {distribution}\mspace{14mu} {network}} \end{matrix} \\ \begin{matrix} {{{pg}_{j,\; t}^{{dist},\; k} - {PD}_{j,\; t}^{{dist},\; k}},} \\ {j\mspace{14mu} {is}\mspace{14mu} {not}\mspace{14mu} {connected}\mspace{14mu} {to}\mspace{14mu} {the}\mspace{14mu} k^{th}\mspace{14mu} {distribution}\mspace{14mu} {network}} \end{matrix} \end{matrix},} \right.$

where pg_(j,t) ^(dist,k) is a real power output of the generator at the bus j of the distribution network k during the period t, PD_(j,t) ^(dist,k) is a load predication value at the bus j of the distribution network k during the period t, and pb_(t) ^(dist,k) is a transferred real power from the transmission network to the distribution network k during the period t.

In some embodiments of the present disclosure, l_(i→j,t) ^(dist,k) is obtained according to a formula of:

l_(i → j, t)^(dist, k) = [(P̂_(i → j, t)^(dist, k))² + (Q̂_(i → j, t)^(dist, k))²]R_(i → j)^(dist, k)/(V̂_(i, t)^(dist, k))² + 2(p_(i → j, t)^(dist, k) − P̂_(i → j, t)^(dist, k))P̂_(i → j, t)^(dist, k)R_(i → j)^(dist, k)/(V̂_(i, t)^(dist, k))², ∀(i → j) ∈ L^(dist, k), ∀t ∈ T,

where, {circumflex over (P)}_(i→j,t) ^(dist,k) is operational base points of real power from a bus i to a bus j in a distribution network k during a period t. {circumflex over (Q)}_(i→j,t) ^(dist,k) is operational base points of reactive power from the bus i to the bus j in a distribution network k during the period t, {circumflex over (V)}_(i,t) ^(dist,k) is an operational base point of voltage magnitude of the bus i during the period t, in which operation data corresponding to lines with similar history load level is selected as the operational base point, R_(i→j) ^(dist,k) is a line resistance from the bus i to the bus j.

The constraints of line transmission capacity of the distribution network are denoted by a formula of:

−PL _(i→j) ^(dist,k) ≤p _(i→j,t) ^(dist,k) ≤PL _(i→j) ^(dist,k), ∀(i→j)∈L ^(dist,k) , ∀t∈T  (10)

where, PL_(i→j) ^(dist,k) is an active power limit of line from the bus i to the bus j in the distribution network k.

The active power constraints of generators in the distribution network are denoted by a formula of:

PG _(i) ^(dist,k) ≤pg _(i,t) ^(dist,k) ≤PG _(t) ^(dist,k) , ∀i∈G ^(dist,k) , ∀t∈T  (11).

(1-2-3) The boundary constraints of the integrated transmission and distribution network

The boundary constraints of the integrated transmission and distribution network aims to get a balance between an active power sent from the transmission network and an active power received by the at least one distribution network at each dispatching period.

The boundary constraints of the integrated transmission and distribution network are denoted by a formula of:

pb _(I(k),t) ^(trans) =pb _(t) ^(dist,k) , ∀k∈DIST, ∀t∈T  (12)

where, pb_(i,t) ^(trans) is a transferred real power at a bus i of the transmission network to the at least one distribution network during a period t, I(k) is a bus in the distribution connected to the distribution network k, pb_(t) ^(dist,k) is a transferred real power from the transmission network to the distribution network k during the period t.

-   -   (2) The dispatch model established in (1) is transformed into a         dispatch model in a matrix form.

In detail, the dispatch model is transformed into the dispatch model in the matrix form by a formula of:

$\begin{matrix} \begin{matrix} {{\min \mspace{11mu} {C^{trans}\left( x^{trans} \right)}} + {\sum\limits_{k \in {DIST}}{C^{{dist},\; k}\left( x^{{dist},\; k} \right)}}} \\ {{{subject}\mspace{14mu} {to}},\; {{{A^{k}x^{trans}} + {B^{k}x^{{dist},\; k}}} \leq c^{k}}} \\ {x^{trans} \in X^{trans}} \\ {{x^{{dist},\; k} \in X^{{dist},\; k}},{\forall{k \in {DIST}}}} \end{matrix} & (13) \end{matrix}$

where, C^(trans)(x^(trans)) is an objective function of the transmission network, C^(dist,k)(x^(dist,k)) is an objective function of the distribution network k, X^(trans) is a constraint set corresponding to the transmission network, X^(dist,k) is a constraint set corresponding to the distribution network k, A^(k)x^(trans)+B^(k)x^(dist,k)≤c^(k) is the boundary constraint, A^(k), B^(k), and c^(k) are a coefficient of the transmission network, a coefficient of the distribution network k, and a constant coefficient respectively, wherein, values of columns corresponding to Pb_(j(k),t) ^(trans) in A^(k) are 1, and values of other columns in A^(k) are 0, values of columns corresponding to pb_(t) ^(dist,k) in B^(k) are −1, and values of other columns in B^(k) are 0, and c^(k) is 0.

-   -   (3) The dispatch model in the matrix form obtained in (2) is         solved

FIG. 2 is a flow chart of a method for solving a dispatch model according to another exemplary embodiment. As illustrated in FIG. 2, the method includes followings.

(3-1) An iteration number m is initialized as 0. A feasible cut set FC is initialized as a universal set.

(3-2) A solution x_((m)) ^(trans) of real power of the transmission network is obtained by solving a formula of:

min C ^(trans)(x ^(trans))

subject to, x ^(trans) ∈X ^(trans)

x ^(trans) ∈FC  (14).

(3-3) It is determined whether there is a solution of real power for each distribution network denoted as x_((m)) ^(dist,k) by solving a distribution network problem denoted as (taking the k^(th) distribution network as an example):

min C ^(dist,k)(x ^(dist,k))

subject to, A ^(k) x _((m)) ^(trans) +B ^(k) x ^(dist,k) ≤c ^(k)

x ^(dist,k) ∈X ^(dist,k)  (15).

If yes, (3-4) is executed, other wise (3-5) is executed.

(3-4) A local optimal function C_((m)) ^(k)(x^(trans)) and a critical region CR_((m)) ^(k) of the local optimal function C_((m)) ^(k)(x^(trans)) are determined.

Physical significance of C_((m)) ^(k)(x^(trans)) and CR_((m)) ^(k) is in a critical region of the local optimal objective function, the local optimal objective function can completely represent a relationship between the objective function of the distribution network and boundary variables. A method for determining the local optimal objective function C_((m)) ^(k)(x^(trans)) and the critical region CR_((m)) ^(k) of the locally optimal function C_((m)) ^(k)(x^(trans)) may include followings.

(3-4-1) Formula (15) is reformulated into a standard quadratic programming form by a formula of:

min ½(x ^(dist,k))^(T) Q(x ^(dist,k))+f ^(T) x ^(dist,k+r)

subject to, Âx _((m)) ^(trans) +{circumflex over (B)}x ^(dist,k) ≤ĉ  (17)

wherein, Q is a quadratic matrix

${\sum\limits_{t \in T}{\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},\; k}}{C_{i}^{{dist},\; k}\left( {pg}_{i,\; t}^{{dist},\; k} \right)}}}},$

f is a linear vector of

${\sum\limits_{t \in T}{\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},\; k}}{C_{i}^{{dist},\; k}\left( {pg}_{i,\; t}^{{dist},\; k} \right)}}}},$

and r is a constant coefficient of

${\sum\limits_{t \in T}{\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},\; k}}{C_{i}^{{dist},\; k}\left( {pg}_{i,\; t}^{{dist},\; k} \right)}}}},$

elements on diagonals of the quadratic matrix Q and corresponding to pg_(i,t) ^(dist,k) are a_(2,i), other elements in the quadratic matrix Q are 0, elements in the linear vector f and corresponding to pg_(i,t) ^(dist,k) are a_(1,i), other elements in the linear vector f are 0, the constant coefficient r is

${\sum\limits_{t \in T}{\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},\; k}}a_{0,i}}}},$

Â is coefficients of the transmission network in a constraint set comprising the constraints of the at least one distribution network and the boundary constraint, {circumflex over (B)} is coefficients of the distribution network in the constraint set comprising the constraints of the at least one distribution network and the boundary constraint, ĉ is constant coefficients in the constraint set comprising the constraints of the at least one distribution network and the boundary constraint.

In some embodiments, Â, {circumflex over (B)}, and ĉ are obtained according to the power flow constraint, the constraint of line transmission capacity of the distribution network, the active power constraint of generators in the distribution network, and the boundary constraint.

In detail, a process of obtaining Â, {circumflex over (B)}, and ĉ according to the power flow constraint, the constraint of line transmission capacity of the distribution network, the active power constraint of generators in the distribution network, and the boundary constraint includes followings. The power flow constraint, the constraint of line transmission capacity of the distribution network, the active power constraint of generators in the distribution network, and the boundary constraint are reformulated in a form of a standard matrix inequality. Columns corresponding to x_((m)) ^(trans) in the standard matrix inequality generates Â, columns corresponding to x^(dist,k) in the standard matrix inequality generates {circumflex over (B)}, and right elements of the standard matrix inequality generates ĉ.

(3-4-2) Active constraints on a solution of formula (17) and inactive constraints on the solution of formula (17) are determined.

(3-4-3) The local optimal function and the feasible region of the local optimal function are obtained according to the active constraints on the solution of formula (17) and the inactive constraints on the solution of formula (17).

The feasible region CR_((m)) ^(k) of the local optimal function is denoted by a formula of:

CR _((m)) ^(k) ={x ^(trans) |K ₁ x ^(trans) ≥K ₂,(Â _(I) +{circumflex over (B)} _(I) M ₁ K ₁)x ^(trans) ≤ĉ _(I) −{circumflex over (B)} _(I)(M ₁ K ₂ +M ₂)}  (18),

and, the local optimal function C_((m)) ^(k)(x^(trans)) is denoted by a formula of:

$\begin{matrix} {{{C_{(m)}^{k}\left( x^{trans} \right)} = {{\frac{1}{2}\left( x^{trans} \right)^{T}\left( {K_{1}^{T}M_{1}^{T}{QM}_{1}K_{1}} \right)\left( x^{trans} \right)} + {\left( {{f^{T}M_{1}K_{1}} + {\left( {{M_{1}K_{2}} + M_{2}} \right)^{T}{QM}_{1}K_{1}}} \right)x^{trans}} + \left( {r + {f^{T}\left( {{M_{1}K_{2}} + M_{2}} \right)} + {\frac{1}{2}\left( {{M_{1}K_{2}} + M_{2}} \right)^{T}{Q\left( {{M_{1}K_{2}} + M_{2}} \right)}}} \right)}},} & (19) \\ {\mspace{79mu} {{M_{1} = {{- Q^{- 1}}{\hat{B}}_{A}^{T}}},{M_{2} = {{- Q^{- 1}}f}}}} & \; \end{matrix}$

where, K₁=−({circumflex over (B)}_(A)M₁)⁻¹Â_(A), K₂=−({circumflex over (B)}_(A)M₁)⁻¹({circumflex over (B)}_(A)M₂−ĉ_(A)), in which, a subscript (⋅)_(A) represents the active constraints on the solution of formula (17), and a subscript (⋅)_(I) represents the inactive constraints on the solution of formula (17).

(3-5) A feasible cut is generated and the feasible cut set FC is updated.

In detail (3-5) includes followings.

(3-5-1) A modified dual problem of the distribution network problem is solved to obtain a solution ω₀, in which the modified dual problem is denoted as a formula of:

min ω^(T)(ĉ−Âx _((m)) ^(trans))

s.t. ω^(T) {circumflex over (B)}=0

0≤ω≤1  (20).

(3-5-2) The feasible cut set FC is updated according to a formula of:

FC=FC∩{x ^(trans)|ω₀ ^(T) Âx ^(trans)≤ω₀ ^(T) ĉ}.

(3-6) A solution of real power of the transmission network is obtained by solving a transmission network problem denoted as:

$\begin{matrix} \begin{matrix} {{\min \mspace{11mu} {C^{trans}\left( x^{trans} \right)}} + {\sum\limits_{k \in {DIST}_{(m)}}{C_{(m)}^{k}\left( x^{trans} \right)}}} \\ {{{subject}\mspace{14mu} {to}},\; {x^{trans} \in X^{trans}}} \\ {x^{trans} \in {FC}} \\ {{x^{trans} \in {CR}_{(m)}^{k}},{\forall{k \in {DIST}_{(m)}}}} \end{matrix} & (16) \end{matrix}$

where, DIST_((m)) is an index set of the at least one distribution network whose corresponding sub-problem is feasible during m^(th) iteration.

And then, the iteration number m is increased by 1, and the optimal solution of real power output of the transmission network is denoted as x_((m)) ^(trans).

(3-7) If the distribution network problem is feasible, and a difference between an m^(th) solution and an (m−1)^(th) solution of real power of the transmission network is less than a preset threshold, the obtained solution of real power of the transmission network and the solution of real power of the plurality of distribution networks are determined as the dynamic dispatch parameters of the integrated transmission and distribution network.

(3-8) If there is no solution of real power for each distribution network, or the difference between the m^(th) solution and the (m−1)^(th) solution of real power of the transmission network is larger than or equal to a preset threshold, return to (3-3).

Embodiments of the present disclosure further provide a dispatching device for an integrated transmission and distribution network. The device includes: a processor; and a memory for storing instructions executable by the processor. The processor is configured to perform the above method.

Embodiments of the present disclosure further provide a non-transitory computer readable storage medium. The non-transitory computer readable storage medium according to embodiments of the present disclosure may include instructions that, when executed by a processor of an apparatus, causes the apparatus to execute the above method.

The technical solutions provided by embodiments of the present disclosure have following advantageous effects.

In the technical solutions of the present disclosure, the dispatch model of the integrated transmission and distribution network can be established by combining the dispatch model of the transmission network, the dispatch model of the distribution network, and a dual coupling relationship between the transmission network and the distribution network. An iterative algorithm for solving the proposed dispatch model of the integrated transmission and distribution network using the multi-parameter programming is provided. The provided algorithm has a well rate of convergence, which can solve a power mismatch problem between the transmission network and the distribution network caused by introducing renewable energy sources, and the global optimal solution of the dispatch model of the integrated transmission and distribution network can be obtained. The provided algorithm may have a good convergence rate and may be applied in practical application.

Any process or method described in the flowing diagram or other means may be understood as a module, segment or portion including one or more executable instruction codes of the procedures configured to achieve a certain logic function or process, and the preferred embodiments of the present disclosure include other performances, in which the performance may be achieved in other orders instead of the order shown or discussed, such as in a almost simultaneous way or in an opposite order, which should be appreciated by those having ordinary skills in the art to which embodiments of the present disclosure belong.

The logic and/or procedures indicated in the flowing diagram or described in other means herein, such as a constant sequence table of the executable code for performing a logical function, may be implemented in any computer readable storage medium so as to be adopted by the code execution system, the device or the equipment (such a system based on the computer, a system including a processor or other systems fetching codes from the code execution system, the device and the equipment, and executing the codes) or to be combined with the code execution system, the device or the equipment to be used. With respect to the description of the present invention, “the computer readable storage medium” may include any device including, storing, communicating, propagating or transmitting program so as to be used by the code execution system, the device and the equipment or to be combined with the code execution system, the device or the equipment to be used. The computer readable medium includes specific examples (a non-exhaustive list): the connecting portion (electronic device) having one or more arrangements of wire, the portable computer disc cartridge (a magnetic device), the random access memory (RAM), the read only memory (ROM), the electrically programmable read only memory (EPROMM or the flash memory), the optical fiber device and the compact disk read only memory (CDROM). In addition, the computer readable storage medium even may be papers or other proper medium printed with program, as the papers or the proper medium may be optically scanned, then edited, interpreted or treated in other ways if necessary to obtain the program electronically which may be stored in the computer memory.

It should be understood that, each part of the present disclosure may be implemented by the hardware, software, firmware or the combination thereof. In the above embodiments of the present invention, the plurality of procedures or methods may be implemented by the software or hardware stored in the computer memory and executed by the proper code execution system. For example, if the plurality of procedures or methods is to be implemented by the hardware, like in another embodiment of the present invention, any one of the following known technologies or the combination thereof may be used, such as discrete logic circuits having logic gates for implementing various logic functions upon an application of one or more data signals, application specific integrated circuits having appropriate logic gates, programmable gate arrays (PGA), field programmable gate arrays (FPGA).

It can be understood by those having the ordinary skills in the related art that all or part of the steps in the method of the above embodiments can be implemented by instructing related hardware via programs, the program may be stored in a computer readable storage medium, and the program includes one step or combinations of the steps of the method when the program is executed.

In addition, each functional unit in the present disclosure may be integrated in one progressing module, or each functional unit exists as an independent unit, or two or more functional units may be integrated in one module. The integrated module can be embodied in hardware, or software. If the integrated module is embodied in software and sold or used as an independent product, it can be stored in the computer readable storage medium.

The non-transitory computer-readable storage medium may be, but is not limited to, read-only memories, magnetic disks, or optical disks.

Reference throughout this specification to “an embodiment,” “some embodiments,” “one embodiment”. “another example,” “an example,” “a specific example,” or “some examples,” means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present disclosure. Thus, the appearances of the phrases such as “in some embodiments,” “in one embodiment”. “in an embodiment”, “in another example,” “in an example,” “in a specific example,” or “in some examples,” in various places throughout this specification are not necessarily referring to the same embodiment or example of the present disclosure. Furthermore, the particular features, structures, materials, or characteristics may be combined in any suitable manner in one or more embodiments or examples.

Although explanatory embodiments have been shown and described, it would be appreciated by those skilled in the art that the above embodiments cannot be construed to limit the present disclosure, and changes, alternatives, and modifications can be made in the embodiments without departing from spirit, principles and scope of the present disclosure. 

What is claimed is:
 1. A dispatching method for an integrated transmission and distribution network, wherein the integrated transmission and distribution network comprises a transmission network and at least one distribution network, the method comprises: establishing a dispatch model of the integrated transmission and distribution network, wherein the dispatch model comprises an objective function and constraints, the objective function is a minimizing function of a total generation cost of the transmission network and the at least one distribution network under the constraints; solving the dispatch model to obtain dynamic dispatch parameters for the integrated transmission and distribution network; and dispatching the integrated transmission and distribution network according to the dynamic dispatch parameters.
 2. The method according to claim 1, wherein the total generation cost of the transmission network and the at least one distribution network is established by a formula of: $\begin{matrix} {{\sum\limits_{t \in T}\; {\sum\limits_{i \in G^{trans}}{C_{i}^{trans}\left( {pg}_{i,t}^{trans} \right)}}} + {\sum\limits_{t \in T}{\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},k}}{C_{i}^{{dist},k}\left( {pg}_{i,t}^{{dist},k} \right)}}}}} & (1) \end{matrix}$ where, T is an index set of dispatching time horizon, G^(trans) is an index set of generator bus numbers in the transmission network, DIST is an index set of the at least one distribution network, G^(dist,k) is an index set of generator bus numbers in a distribution network k, C_(i) ^(trans)(pg_(i,t) ^(trans)) is a cost function of a generator at a bus i of the transmission network during a period t, pg_(i,t) ^(trans) is a real power output of the generator at the bus i of the transmission network during the period t, C_(t) ^(dist,k)(pg_(i,t) ^(dist,k)) is a cost function of a generator at a bus i of the distribution network k during the period t, pg_(i,t) ^(dist,k) is a real power output of the generator at the bus i of the distribution network k during the period t.
 3. The method according to claim 2, wherein C_(i) ^(trans)(pg_(i,t) ^(trans)) is expressed as: C _(trans)(pg _(i,t) ^(trans))=a _(0,t) ^(trans) +a _(1,t) ^(trans) pg _(i,t) ^(trans) +a _(2,t) ^(trans)(pg _(i,t) ^(trans))²  (2), where, a_(0,i) ^(trans) is a constant coefficient of generation cost of the generator at the bus i of the transmission network, a_(1,i) ^(trans) is a linear coefficient of generation cost of the generator at the bus i of the transmission network, and a_(2,i) ^(trans) is a quadratic coefficient of generation cost of the generator at the bus i of the transmission network.
 4. The method according to claim 2, wherein C_(i) ^(dist,k)(pg_(i,t) ^(dist,k)) is expressed as: C _(i) ^(dist,k)(pg _(i,t) ^(dist,k))=a _(0,i) ^(dist,k) +a _(1,t) ^(dist,k) pg _(i,t) ^(dist,k) +a _(2,t) ^(dist,k)(pg _(i,t) ^(dist,k))²  (3) where, a_(0,i) ^(dist,k) is a constant coefficient of generation cost of the generator at the bus i of the distribution network k, a_(1,i) ^(dist,k) is a linear coefficient of generation cost of the generator at the bus i of the distribution network k, and a_(2,i) ^(dist,k) is a quadratic coefficient of generation cost of the generator at the bus i of the distribution network k.
 5. The method according to claim 1, wherein the constraints comprise constraints of the transmission network, constraints of the at least one distribution network, and boundary constraints: the constraints of the transmission network comprise power balance constraints, constraints of line transmission capacity of the transmission network, spinning reserve constraints, ramping constraints, and active power constraints of generators in the transmission network; the constraints of the at least one distribution network comprise power flow constraints, constraints of line transmission capacity of each distribution network, and active power constraints of generators in each distribution network.
 6. The method according to claim 5, wherein the power balance constraints are denoted by a formula of $\begin{matrix} {{{\sum\limits_{i \in G^{trans}}{pg}_{i,t}^{trans}} = {{\sum\limits_{i \in B^{trans}}{pb}_{i,t}^{trans}} + {\sum\limits_{i \in D^{trans}}{PD}_{i,t}^{trans}}}},{\forall{t \in T}}} & (4) \end{matrix}$ where, T is an index set of dispatching time horizon, G^(trans) is an index set of generator bus numbers in the transmission network, pg_(i,t) ^(trans) is a real power output of the generator at a bus i of the transmission network during a period t, B^(trans) is an index set of boundary bus numbers between the transmission network and the at least one distribution network, pb_(i,t) ^(trans) is a transferred real power at the bus i of the transmission network to the at least one distribution network during the period t, D^(trans) is an index set of load bus numbers of the transmission network, PD_(i,t) ^(trans) is a load predication value at the bus i during the period t; the constraints of line transmission capacity of the transmission network are denoted by a formula f $\begin{matrix} {{{- {PL}_{n}^{trans}} \leq {{\sum\limits_{i \in G^{trans}}{{SF}_{n - i}^{trans}{pg}_{i,t}^{trans}}} - {\sum\limits_{i \in B^{trans}}{{SF}_{n - i}^{trans}{pb}_{i,t}^{trans}}} - {\sum\limits_{i \in D^{trans}}{{SF}_{n - i}^{trans}{PD}_{i,t}^{trans}}}} \leq {PL}_{n}^{trans}},\mspace{79mu} {\forall{n \in L^{trans}}},{\forall{t \in T}}} & (5) \end{matrix}$  where, PL_(n) ^(trans) is an active power flow limit of a line n in the transmission network, SF_(n-i) ^(trans) is a shift distribution factor of the bus i on the line n, the shift distribution factor is a topological parameter of the integrated transmission and distribution network, L^(trans) is an index set of line numbers of the transmission network; the spinning reserve constraints are denoted by a formula of, $\begin{matrix} {{{0 \leq {ru}_{i,t}^{trans} \leq {{RU}_{i}^{trans}\Delta \; t}},{{ru}_{i,t}^{trans} \leq {{\overset{\_}{PG}}_{i}^{trans} - {pg}_{i,t}^{trans}}},{\forall{i \in G^{trans}}},{\forall{t \in T}}}{{0 \leq {rd}_{i,t}^{trans} \leq {{RD}_{i}^{trans}\Delta \; t}},{{rd}_{i,t}^{trans} \leq {{pg}_{i,t}^{trans} - {\underset{\_}{PG}}_{i}^{trans}}},{\forall{i \in G^{trans}}},{\forall{t \in T}}}{{\sum\limits_{i \in G^{trans}}{ru}_{i,t}^{trans}} \geq {SRU}_{i}^{trans}},{{\sum\limits_{i \in G^{trans}}{rd}_{i,t}^{trans}} \geq {SRD}_{i}^{trans}},{\forall{t \in T}}} & (6) \end{matrix}$  where, ru_(i,t) ^(trans) is an upward spinning reserve contribution of the generator at the bus i of the transmission network during the period t, rd_(i,t) ^(trans) is a downward spinning reserve contribution of the generator at the bus i of the transmission network during the period t, RU_(i) ^(trans) is an upward ramp rate of the generator at the bus i of the transmission network during the period t, RD_(i) ^(trans) is a downward ramp rate of the generator at the bus i of the transmission network during the period t, Δt is a time interval for dispatching, PG _(i) ^(trans) is a maximum real power output of the generator at the bus i of the transmission network, PG _(i) ^(trans) is a minimum real power output of the generator at the bus i of the transmission network, SRU_(t) ^(trans) is an upward spinning reserve capacity requirement of the transmission network during the period t, SRD_(i) ^(trans) is a downward spinning reserve capacity requirement of the transmission network during the period t; the ramping constraints are denoted by a formula of −RD _(i) ^(trans) Δt≤pg _(i,t+1) ^(trans) −pg _(i,t) ^(trans) ≤RU _(i) ^(trans) Δt, ∀i∈G ^(trans) , ∀t∈T  (7);  and the active power constraints of generators in the transmission network are denoted by a formula of PG _(i) ^(trans) ≤pg _(i,t) ^(trans) ≤PG _(i) ^(trans) , ∀i∈G ^(trans) , ∀t∈T  (8).
 7. The method according to claim 5, wherein the power flow constraints are denoted by a formula of $\begin{matrix} {{{{\sum\limits_{{i\text{:}i}\rightarrow j}\; \left( {p_{{i\rightarrow j},t}^{{dist},k} - l_{{i\rightarrow j},t}^{{dist},k}} \right)} + p_{j,t}^{{dist},k}} = {\sum\limits_{{m\text{:}j}\rightarrow m}p_{{j\rightarrow m},t}^{{dist},k}}},{\forall{j \in N^{{dist},k}}},{\forall{t \in T}}} & (9) \end{matrix}$ where, T is an index set of dispatching time horizon, p_(i→j,t) ^(dist,k) is a line flow from a bus i to a bus j in a distribution network k during a period t, l_(i→j,t) ^(dist,k) is a line loss from the bus i to the bus j in the distribution network k during the period t, p_(j,t) ^(dist,k) is an power injection at the bus j in the distribution network k during the period t, N^(dist,k) is an index set of bus numbers of the distribution network k; the constraints of line transmission capacity of the distribution network are denoted by a formula of −PL _(i→j) ^(dist,k) ≤p _(i→j,t) ^(dist,k) ≤PL _(i→j) ^(dist,k), ∀(i→j)∈L ^(dist,k) , ∀t∈T  (10)  where, PL_(i→j) ^(dist,k) is an active power limit of line from the bus i to the bus j in the distribution network k; and the active power constraints of generators in the distribution network are denoted by a formula of PG _(i) ^(dist,k) ≤pg _(i,t) ^(dist,k) ≤PG _(t) ^(dist,k) , ∀i∈G ^(dist,k) , ∀t∈T  (11).
 8. The method according to claim 7, wherein p_(j,t) ^(dist,k) is obtained according to a formula of $p_{j,t}^{{dist},k} = \left\{ {\begin{matrix} {{{{pg}_{j,t}^{{dist},k} - {PD}_{j,t}^{{dist},k} + {pb}_{t}^{{dist},k}},{j\mspace{14mu} {is}\mspace{14mu} {connected}\mspace{14mu} {to}\mspace{20mu} {the}\mspace{14mu} k^{th}\mspace{11mu} {distribution}\mspace{14mu} {network}}}\;} \\ {{{pg}_{j,t}^{{dist},k} - {PD}_{j,t}^{{dist},k}},{j\mspace{14mu} {is}\mspace{14mu} {not}{\mspace{11mu} \;}{connected}\mspace{14mu} {to}\mspace{20mu} {the}\mspace{14mu} k^{th}\mspace{11mu} {distribution}\mspace{14mu} {network}}} \end{matrix},} \right.$ ∀j∈N^(dist,k), ∀t∈T, where pg_(j,t) ^(dist,k) is a real power output of the generator at the bus j of the distribution network k during the period t, PD_(j,t) ^(dist,k) is a load predication value at the bus j of the distribution network k during the period t, and pb_(t) ^(dist,k) is a transferred real power from the transmission network to the distribution network k during the period t.
 9. The method according to claim 7, wherein l_(i→j,t) ^(dist,k) is obtained according to a formula of l_(i → j, t)^(dist, k) = [(P̂_(i → j, t)^(dist, k))² + (Q̂_(i → j, t)^(dist, k))²]R_(i → j)^(dist, k)/(V̂_(i, t)^(dist, k))², +2(p_(i → j, t)^(dist, k) − P̂_(i → j, t)^(dist, k))P̂_(i → j, t)^(dist, k)R_(i → j)^(dist, k)/(V̂_(i, t)^(dist, k))², ∀(i → j) ∈ L^(dist, k), ∀t ∈ T where, {circumflex over (P)}_(i→j,t) ^(dist,k) is operational base points of real power from the bus i to the bus j in a distribution network k during a period t, {circumflex over (Q)}_(i→j,t) ^(dist,k) is operational base points of reactive power from the bus i to the bus j in a distribution network k during the period t, {circumflex over (V)}_(i,t) ^(dist,k) is an operational base point of voltage magnitude of the bus i during the period t, R_(i→j) ^(dist,k) is a line resistance from the bus i to the bus j.
 10. The method according to claim 5, wherein the boundary constraints are denoted by a formula of pb _(I(k),t) ^(trans) =pb _(t) ^(dist,k) , ∀k∈DIST, ∀t∈T  (12) where, T is an index set of dispatching time horizon, DIST is an index set of the at least one distribution network, pb_(i,t) ^(trans) is a transferred real power at a bus i of the transmission network to the at least one distribution network during a period t, I(k) is a bus in the distribution connected to the distribution network k, pb_(t) ^(dist,k) is a transferred real power from the transmission network to the distribution network k during the period t.
 11. The method according to claim 1, wherein the dispatch model is transformed into a matrix form by a formula of $\begin{matrix} {{{\min \mspace{11mu} {C^{trans}\left( x^{trans} \right)}} + {\sum\limits_{k \in {DIST}}\; {C^{{dist},k}\left( x^{{dist},k} \right)}}}{{{subject}\mspace{14mu} {to}},{{{A^{k}x^{trans}} + {B^{k}x^{{dist},k}}} \leq c^{k}}}{x^{trans} \in X^{trans}}{{x^{{dist},k} \in X^{{dist},k}},\mspace{14mu} {\forall{k \in {DIST}}}}} & (13) \end{matrix}$ where, C^(trans)(x^(trans)) is an objective function of the transmission network, C^(dist,k)(x^(dist,k)) is an objective function of the distribution network k, X^(trans) is a constraint set corresponding to the transmission network, X^(dist,k) is a constraint set corresponding to the distribution network k, A^(k)x^(trans)+B^(k)x^(dist,k)c^(k) is the boundary constraint, A^(k), B^(k), and c^(k) are a coefficient of the transmission network, a coefficient of the distribution network k, and a constant coefficient respectively, wherein, values of columns corresponding to Pb_(j(k),t) ^(trans) in A^(k) are 1, and values of other columns in A^(k) are 0, values of columns corresponding to pb_(t) ^(dist,k) in B^(k) are −1, and values of other columns in B^(k) are 0, and c^(k) is
 0. 12. The method according to claim 11, wherein solving the dispatch model to obtain dynamic dispatch parameters for the integrated transmission and distribution network comprises: S1, initializing an iteration number m as 0, and initializing a feasible cut set FC as a universal set; S2, obtaining a solution x_((m)) ^(trans) of real power of the transmission network by solving a formula of min C ^(trans)(x ^(trans)) subject to, x ^(trans) ∈X ^(trans) x ^(trans) ∈FC  (14); S3, determining whether there is a solution of real power for each distribution network denoted as x_((m)) ^(dist,k) by solving a distribution network problem denoted as min C ^(dist,k)(x ^(dist,k)) subject to, A ^(k) x _((m)) ^(trans) +B ^(k) x ^(dist,k) ≤c ^(k) x ^(dist,k) ∈X ^(dist,k)  (15); S4, if yes, determining a local optimal function C_((m)) ^(k)(x^(trans)) and a critical region CR_((m)) ^(k) of the locally function C_((m)) ^(k)(x^(trans)); S5, if no, generating a feasible cut and updating the feasible cut set FC; S6, obtaining a solution of real power of the transmission network by solving a transmission network problem denoted as $\begin{matrix} {{{\min \mspace{11mu} {C^{trans}\left( x^{trans} \right)}} + {\sum\limits_{k \in {DIST}_{(m)}}{C_{(m)}^{k}\left( x^{trans} \right)}}}{{{subject}\mspace{14mu} {to}},{x^{trans} \in X^{trans}}}{x^{trans} \in {FC}}{{x^{trans} \in {CR}_{(m)}^{k}},\mspace{14mu} {\forall{k \in {DIST}_{(m)}}}}} & (16) \end{matrix}$  where, DIST_((m)) is an index set of the at least one distribution network whose corresponding sub-problem is feasible during m^(th) iteration, increasing the iteration number m by 1, and denoting the solution of real power of the transmission network as x_((m)) ^(trans); S7, if the distribution network problem is feasible, and a difference between an m^(th) solution and an (m−1)^(th) solution of real power of the transmission network is less than a preset threshold, determining obtained solution of real power of the transmission network and obtained solution of real power of the plurality of distribution networks as the dynamic dispatch parameters; S8, if there is no solution of real power for each distribution network, or the difference between the m^(th) solution and the (m−1)^(th) solution of real power of the transmission network is larger than or equal to a preset threshold, repeating steps S3-S7.
 13. The method according to claim 12, wherein determining a local optimal function C_((m)) ^(k)(x^(trans)) and a critical region CR_((m)) ^(k) of the locally function C_((m)) ^(k)(x^(trans)) comprises: reformulating formula (15) into a standard quadratic programming form by a formula of min ½(x ^(dist,k))^(T) Q(x ^(dist,k))+f ^(T) x ^(dist,k+r) subject to, Âx _((m)) ^(trans) +{circumflex over (B)}x ^(dist,k) ≤ĉ  (17)  wherein, Q is a quadratic matrix of ${\sum\limits_{t \in T}\; {\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},k}}\; {C_{i}^{{dist},k}\left( {pg}_{i,t}^{{dist},k} \right)}}}},$  f is a linear vector of ${\sum\limits_{t \in T}\; {\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},k}}\; {C_{i}^{{dist},k}\left( {pg}_{i,t}^{{dist},k} \right)}}}},$  and r is a constant coefficient of ${\sum\limits_{t \in T}\; {\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},k}}\; {C_{i}^{{dist},k}\left( {pg}_{i,t}^{{dist},k} \right)}}}},$  elements on diagonals of the quadratic matrix Q and corresponding to pg_(i,t) ^(dist,k) are a_(2,i), other elements in the quadratic matrix Q are 0, elements in the linear vector f and corresponding to pg_(i,t) ^(dist,k) are a_(1,i), other elements in the linear vector f are 0, the constant coefficient r is ${\sum\limits_{t \in T}\; {\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},k}}a_{0,i}}}},$  Â is coefficients of the transmission network in a constraint set comprising the constraints of the at least one distribution network and the boundary constraint, {circumflex over (B)} is coefficients of the distribution network in the constraint set comprising the constraints of the at least one distribution network and the boundary constraint, ĉ is constant coefficients in the constraint set comprising the constraints of the at least one distribution network and the boundary constraints; determining active constraints on a solution of formula (17) and inactive constraints on the solution of formula (17); obtaining the local optimal function and the feasible region of the local optimal function according to the active constraints on the solution of formula (17) and the inactive constraints on the solution of formula (17), wherein the feasible region CR_((m)) ^(k) of the local optimal function is denoted by a formula of: CR _((m)) ^(k) ={x ^(trans) |K ₁ x ^(trans) ≥K ₂,(Â _(I) +{circumflex over (B)} _(I) M ₁ K ₁)x ^(trans) ≤ĉ _(I) −{circumflex over (B)} _(I)(M ₁ K ₂ +M ₂)}  (18), and the local optimal function C_((m)) ^(k)(x^(trans)) is denoted by a formula of: $\begin{matrix} {{{{C_{(m)}^{k}\left( x^{trans} \right)} = {{\frac{1}{2}\left( x^{trans} \right)^{T}\left( {K_{1}^{T}M_{1}^{T}Q\; M_{1}K_{1}} \right)\left( x^{trans} \right)} + {\left( {{f^{T}M_{1}K_{1}} + {\left( {{M_{1}K_{2}} + M_{2}} \right)^{T}Q\; M_{1}K_{1}}} \right)x^{trans}} + \left( {r + {f^{T}\left( {{M_{1}K_{2}} + M_{2}} \right)} + {\frac{1}{2}\left( {{M_{1}K_{2}} + M_{2}} \right)^{T}{Q\left( {{M_{1}K_{2}} + M_{2}} \right)}}} \right)}}\mspace{20mu} {M_{1} = {{- Q^{- 1}}{\hat{B}}_{A}^{T}}}},\mspace{14mu} {M_{2} = {{- Q^{- 1}}f}},} & (19) \end{matrix}$ where, K₁=−({circumflex over (B)}_(A)M₁)⁻¹Â_(A), K₂=−({circumflex over (B)}_(A)M₁)⁻¹({circumflex over (B)}_(A)M₂−ĉ_(A)), wherein, a subscript (⋅)_(A) represents the active constraints on the solution of formula (17), and a subscript (⋅)_(t) represents the inactive constraints on the solution of formula (17).
 14. The method according to claim 13, further comprising: obtaining Â, {circumflex over (B)}, and ĉ according to the power flow constraint, the constraint of line transmission capacity of the distribution network, the active power constraint of generators in the distribution network, and the boundary constraint; wherein, obtaining Â, {circumflex over (B)}, and ĉ according to the power flow constraint, the constraint of line transmission capacity of the distribution network, the active power constraint of generators in the distribution network, and the boundary constraint comprises: reformulating the power flow constraint, the constraint of line transmission capacity of the distribution network, the active power constraint of generators in the distribution network, and the boundary constraint in a form of a standard matrix inequality, where, columns corresponding to x_((m)) ^(trans) in the standard matrix inequality generates Â, columns corresponding to x^(dist,k) in the standard matrix inequality generates {circumflex over (B)}, right elements of the standard matrix inequality generates ĉ.
 15. The method according to claim 12, wherein generating a feasible cut and updating the feasible cut set FC comprises: solving a modified dual problem of the distribution network problem to obtain a solution ω₀, wherein the modified dual problem is denoted as a formula of: min ω^(T)(ĉ−Âx _((m)) ^(trans)) s.t. ω^(T) {circumflex over (B)}=0 0≤ω≤1  (20); updating the feasible cut set FC according to a formula of: FC=FC∩{x ^(trans)|ω₀ ^(T) Âx ^(trans)≤ω₀ ^(T) ĉ}.
 16. A dispatching device for an integrated transmission and distribution network, wherein the integrated transmission and distribution network comprises a transmission network and at least one distribution network, and the device comprises: a processor; and a memory for storing instructions executable by the processor, wherein the processor is configured to: establish a dispatch model of the integrated transmission and distribution network, wherein the dispatch model comprises an objective function and constraints, the objective function is a minimizing function of a total generation cost of the transmission network and the at least one distribution network under the constraints; solve the dispatch model to obtain dynamic dispatch parameters for the integrated transmission and distribution network, and dispatch the integrated transmission and distribution network according to the dynamic dispatch parameters.
 17. The device according to claim 16, wherein the total generation cost of the transmission network and the at least one distribution network is established by a formula of: $\begin{matrix} {{\sum\limits_{t \in T}{\sum\limits_{i \in G^{trans}}{C_{i}^{trans}\left( {pg}_{i,t}^{trans} \right)}}} + {\sum\limits_{t \in T}{\sum\limits_{k \in {DIST}}{\sum\limits_{i \in G^{{dist},k}}{C_{i}^{{dist},k}\left( {pg}_{i,t}^{{dist},k} \right)}}}}} & (1) \end{matrix}$ where, T is an index set of dispatching time horizon, G^(trans) is an index set of generator bus numbers in the transmission network, DIST is an index set of the at least one distribution network, G^(dist,k) is an index set of generator bus numbers in a distribution network k, C_(i) ^(trans)(pg_(i,t) ^(trans)) is a cost function of a generator at a bus i of the transmission network during a period t, pg_(i,t) ^(trans) is a real power output of the generator at the bus i of the transmission network during the period t, C_(i) ^(trans)(pg_(i,t) ^(dist,k)) is a cost function of a generator at a bus i of the distribution network k during the period t, pg_(i,t) ^(dist,k) is a real power output of the generator at the bus i of the distribution network k during the period t.
 18. The device according to claim 16, wherein the constraints comprise constraints of the transmission network, constraints of the at least one distribution network, and boundary constraints: the constraints of the transmission network comprise power balance constraints, constraints of line transmission capacity of the transmission network, spinning reserve constraints, ramping constraints, and active power constraints of generators in the transmission network; the constraints of the at least one distribution network comprise power flow constraints, constraints of line transmission capacity of each distribution network, and active power constraints of generators in each distribution network.
 19. A non-transitory computer-readable storage medium having stored therein instructions that, when executed by a processor of a computer, causes the computer to perform a dispatching method for an integrated transmission and distribution network, wherein the integrated transmission and distribution network comprises a transmission network and at least one distribution network, the method comprises: establishing a dispatch model of the integrated transmission and distribution network, wherein the dispatch model comprises an objective function and constraints, the objective function is a minimizing function of a total generation cost of the transmission network and the at least one distribution network under the constraints; solving the dispatch model to obtain dynamic dispatch parameters for the integrated transmission and distribution network; and dispatching the integrated transmission and distribution network according to the dynamic dispatch parameters. 